{\rtf1\ansi\ansicpg936\deff0{\fonttbl{\f0\fnil\fcharset134 \'cb\'ce\'cc\'e5;}}
{\*\generator Msftedit 5.41.21.2512;}\viewkind4\uc1\pard\sa200\sl276\slmult1\lang2052\f0\fs22 #include <iostream>  \par
#include <string>  \par
#include <math.h> \par
#include<stdlib.h>\par
#include<time.h> \par
#include<conio.h>\par
using namespace std;  \par
const double LING = 1E-6;  \par
const int CONT = 4;  \par
const int VOLUE = 24;\par
#define SIZE 50 \par
typedef int DATA;  //\'b6\'a8\'d2\'e5\'d5\'bb\'d4\'aa\'cb\'d8\'c0\'e0\'d0\'cd  \par
double number[CONT]; \par
string expression[CONT]; \par
bool m_judge = false; //\'c5\'d0\'b6\'cf\'ca\'c7\'b7\'f1\'d3\'d0\'bd\'e2\'a1\'a3  \par
int count = 0; \par
typedef struct stack  \par
\{  \par
    DATA data[SIZE+1];   //\'ca\'fd\'be\'dd\'d4\'aa\'cb\'d8  top\'ce\'aao\'b1\'ed\'ca\'be\'d5\'bb\'ce\'aa\'bf\'d5   \par
    int top;   //\'b6\'a8\'d2\'e5\'d5\'bb\'b6\'a5  \par
       \par
\} seqStack; \par
\par
//\'b3\'f5\'ca\'bc\'bb\'af\'d5\'bb\par
seqStack *seqStackInit()  \par
\{  \par
    seqStack *p;  \par
    if(p=(seqStack *)malloc(sizeof(seqStack)))  //\'c9\'ea\'c7\'eb\'c4\'da\'b4\'e6  \par
    \{  \par
        p->top=0;  \par
        return p;  \par
    \}   \par
    return NULL;  //\'c9\'ea\'c7\'eb\'c4\'da\'b4\'e6\'ca\'a7\'b0\'dc   \par
\}  \par
// \'c5\'d0\'b6\'cf\'d5\'bb\'b5\'c4\'d7\'b4\'cc\'ac\par
int seqStackIsempty(seqStack *s)  //\'d5\'bb\'ca\'c7\'b7\'f1\'ce\'aa\'bf\'d5  \par
\{  \par
    return(s->top==0);  \par
\}   \par
  \par
int seqStackIsfull(seqStack *s)  //\'d5\'bb\'ca\'c7\'b7\'f1\'c2\'fa  \par
\{  \par
    return(s->top==SIZE);  \par
\} \par
\par
// \'c7\'e5\'bf\'d5\'d5\'bb  \'ca\'cd\'b7\'c5\'d5\'bb\'cb\'f9\'d5\'bc\'b5\'c4\'c4\'da\'b4\'e6\'bf\'d5\'bc\'e4\par
void seqStackClear(seqStack *s)  \par
\{  \par
    s->top=0;   //\'c7\'e5\'bf\'d5\'d5\'bb   \par
\}  \par
  \par
void seqStackfree(seqStack *s)  //\'ca\'cd\'b7\'c5\'d5\'bb\'b5\'c4\'bf\'d5\'bc\'e4   \par
\{  \par
    if(s)  \par
      free(s);   \par
      \par
\} \par
//\'c8\'eb\'d5\'bb\'b2\'d9\'d7\'f7\par
int seqStackPush(seqStack *s,DATA data)  \par
\{  \par
    if((s->top+1)>SIZE)       //\'d5\'bb\'b5\'c4\'c9\'cf\'d2\'bb\'b8\'f6\'ce\'bb\'d6\'c3\'b3\'ac\'b9\'fd\'d7\'ee\'b4\'f3\'ce\'bb\'d6\'c3   \par
    \{  \par
        printf("\'d5\'bb\'d2\'e7\'b3\'f6\\n");  \par
        return 0;  \par
    \}  \par
    s->data[++s->top]=data;   //\'d0\'de\'b8\'c4\'d5\'bb\'b6\'a5\'d6\'b8\'d5\'eb\'a3\'ac\'b0\'d1\'d4\'aa\'cb\'d8\'c8\'eb\'d5\'bb  \par
    return 1;   \par
\}  \par
//\'b3\'f6\'d5\'bb\'b2\'d9\'d7\'f7\par
\par
int seqStackPop(seqStack *s)     //\'b3\'f6\'d5\'bb  \par
\{  \par
    if(s->top==0)  \par
    \{  \par
        printf("\'d5\'bb\'ce\'aa\'bf\'d5:\\n");  \par
        exit(0);  \par
    \}  \par
    return (s->data[s->top--]);  //\'b4\'d3\'d5\'bb\'b6\'a5\'b5\'af\'b3\'f6\'d4\'aa\'cb\'d8   \par
\} \par
//\'bb\'f1\'c8\'a1\'d5\'bb\'b6\'a5\'d4\'aa\'cb\'d8\par
DATA seqStackPeek(seqStack *s)  //\'b6\'c1\'b3\'f6\'d5\'bb\'b6\'a5\'d4\'aa\'cb\'d8  \par
\{  \par
    if(s->top==0)  \par
    \{  \par
        printf("\'d5\'bb\'ce\'aa\'bf\'d5");  \par
        exit(0);  \par
    \}  \par
    return (s->data[s->top]); //\'b7\'b5\'bb\'d8\'d5\'bb\'b6\'a5\'d4\'aa\'cb\'d8   \par
\}   \par
//\'c3\'bf\'b4\'ce\'b6\'c1\'c8\'a1\'bc\'ec\'b2\'e9\'d7\'d6\'b7\'fb\'ca\'c7\'b7\'f1\'ce\'aa\'d4\'cb\'cb\'e3\'b7\'fb\par
int isOperator(char c)    //\'bc\'ec\'b2\'e9\'d7\'d6\'b7\'fb\'ca\'c7\'b7\'f1\'ce\'aa\'d4\'cb\'cb\'e3\'b7\'fb  \par
\{  \par
    switch(c)  \par
    \{  \par
        case '+':  \par
        case '-':  \par
        case '*':  \par
        case '/':  \par
        case '(':  \par
        case ')':  \par
        case '=':  \par
            return 1;  \par
            break;  \par
        default:   \par
           return 0;  \par
           break;       //\'d7\'d6\'b7\'fbc\'ca\'c7\'d4\'cb\'cb\'e3\'b7\'fb\'d4\'f2\'b7\'b5\'bb\'d81\'a3\'ac\'a3\'ac\'b7\'f1\'d4\'f2\'b7\'b5\'bb\'d80      \par
    \}  \par
\}  \par
//\'b1\'c8\'bd\'cf\'d4\'cb\'cb\'e3\'b7\'fb\'b5\'c4\'d3\'c5\'cf\'c8\'bc\'b6\par
int PRI(char oper1,char oper2)     //\'c5\'d0\'b6\'cf\'c1\'bd\'b8\'f6\'d4\'cb\'cb\'e3\'b7\'fb\'b5\'c4\'d3\'c5\'cf\'c8\'bc\'b6  \par
//\'c8\'e7\'b9\'fboper1>oper2\'b7\'b5\'bb\'d81    \'c8\'e7\'b9\'fboper1<oper2\'b7\'b5\'bb\'d8-1   \'c8\'e7\'b9\'fboper1,,oper2\'ca\'c7\'d7\'f3\'d3\'d2\'b7\'fb\'ba\'c5\'b7\'b5\'bb\'d80  \par
  \par
\{  \par
    int pri;  \par
    switch(oper2)   //\'c5\'d0\'b6\'cf\'d3\'c5\'cf\'c8\'bc\'b6  \par
    \{  \par
        case '+':  \par
        case '-':  \par
            if(oper1=='('||oper1=='=')  //\'ce\'aa\'d7\'f3\'c0\'a8\'ba\'c5   \par
            pri=-1;        //oper1<oper2  \par
            else   \par
              pri=1;       //oper1>oper2  \par
            break;  \par
        case '*':  \par
        case '/':  \par
            if(oper1=='*'||oper1=='/'||oper1==')')  \par
              pri=1;   //oper1>oper2  \par
            else  \par
              pri=-1;     //oper1<oper2  \par
              break;  \par
        case '(':  \par
            if(oper1==')')       //\'d3\'d2\'c0\'a8\'ba\'c5\'d3\'d2\'b2\'e0\'b2\'bb\'c4\'dc\'c2\'ed\'c9\'cf\'b3\'f6\'cf\'d6\'d7\'f3\'c0\'a8\'ba\'c5  \par
            \{  \par
                printf("\'d3\'ef\'b7\'a8\'b4\'ed\'ce\'f3\\n");  \par
                exit(0);  \par
            \} else  \par
                pri=-1;       //oper1<oper2  \par
              break;  \par
        case ')':  \par
            if(oper1=='(')  \par
               pri=0;  \par
            else if(oper1=='=')  \par
            \{  \par
                printf("\'c0\'a8\'ba\'c5\'b2\'bb\'c6\'a5\'c5\'e4\\n");  \par
                exit(0);  \par
            \}else  \par
                 pri=1;  \par
               break;  \par
        case '=':  \par
            if(oper1=='(')  \par
            \{  \par
                printf("\'c0\'a8\'ba\'c5\'b2\'bb\'c6\'a5\'c5\'e4\\n");  \par
                exit(0);  \par
            \}else if(oper1=='=')  \par
              pri=0;  //\'b5\'c8\'ba\'c5\'c6\'a5\'c5\'e4\'a3\'ac\'b7\'b5\'bb\'d80  \par
             else  \par
                 pri=1;      //oper1>oper2  \par
               break;       \par
    \}  \par
    return pri;  \par
\}   \par
//\'b6\'d4\'d3\'da\'d3\'c5\'cf\'c8\'bc\'b6\'b8\'df\'b5\'c4\'d4\'cb\'cb\'e3\'b7\'fb\'a3\'ac\'d0\'e8\'d2\'aa\'bd\'ab\'d4\'cb\'cb\'e3\'b7\'fb\'c1\'bd\'b2\'e0\'b5\'c4\'ca\'fd\'be\'dd\'bd\'f8\'d0\'d0\'bc\'c6\'cb\'e3\par
int Calc(int a,int oper,int b)  //\'bc\'c6\'cb\'e3\'c1\'bd\'b8\'f6\'b2\'d9\'d7\'f7\'ca\'fd\'b5\'c4\'bd\'e1\'b9\'fb  \par
\{  \par
    switch(oper)     //\'b8\'f9\'be\'dd\'d4\'cb\'cb\'e3\'b7\'fb\'bc\'c6\'cb\'e3  \par
    \{  \par
        case '+':return a+b;  \par
              \par
        case '-':return a-b;  \par
          \par
        case '*':return a*b;  \par
              \par
        case '/':  \par
            if(b!=0)  \par
              return a/b;  \par
            else  \par
            \{  \par
                printf("\'b3\'fd\'ca\'fd\'b2\'bb\'c4\'dc\'ce\'aa0!\\n");  \par
                exit(0);  \par
            \}  \par
    \}   \par
      \par
\}   \par
//\'bc\'c6\'cb\'e3\'ba\'af\'ca\'fd\par
int CalcExp(char exp[])   //\'b1\'ed\'b4\'ef\'ca\'bd\'bc\'c6\'cb\'e3\'ba\'af\'ca\'fd  \par
\{  \par
      \par
    seqStack *StackOper,*StackData;   //\'d6\'b8\'cf\'f2\'c1\'bd\'b8\'f6\'d5\'bb\'b5\'c4\'d6\'b8\'d5\'eb\'b1\'e4\'c1\'bf\'a3\'ac\'d2\'bb\'b8\'f6\'b2\'d9\'d7\'f7\'b7\'fb\'a3\'ac\'d2\'bb\'b8\'f6\'d4\'cb\'cb\'e3\'ca\'fd  \par
    int i=0,flag=0;   //flag\'d7\'f7\'ce\'aa\'b1\'ea\'d6\'be\'a3\'ac\'d3\'c3\'c0\'b4\'b4\'a6\'c0\'ed\'b6\'e0\'ce\'bb\'ca\'fd  \par
    DATA a,b,c,q,x,t,oper;  \par
    StackOper=seqStackInit();  \par
    StackData=seqStackInit();    //\'b3\'f5\'ca\'bc\'bb\'af\'c1\'bd\'b8\'f6\'d5\'bb  \par
      \par
    q=0;  //\'b1\'e4\'c1\'bfq\'b1\'a3\'b4\'e6\'b6\'e0\'ce\'bb\'ca\'fd\'b5\'c4\'b2\'d9\'d7\'f7  \par
    x='=';  \par
    seqStackPush(StackOper,x);  //\'ca\'d7\'cf\'c8\'b0\'d1\'b5\'c8\'ba\'c5=\'bd\'f8\'c8\'eb\'b2\'d9\'d7\'f7\'d5\'bb  \par
    x=seqStackPeek(StackOper); //\'bb\'f1\'c8\'a1\'b2\'d9\'d7\'f7\'d5\'bb\'b5\'c4\'ca\'d7\'d4\'aa\'cb\'d8   \par
    c=exp[i++];   \par
    while(c!='='||x!='=')  //\'d1\'ad\'bb\'b7\'b4\'a6\'c0\'ed\'b1\'ed\'b4\'ef\'ca\'bd\'d6\'d0\'b5\'c4\'c3\'bf\'d2\'bb\'b8\'f6\'d7\'d6\'b7\'fb  \par
    \{  \par
        if(isOperator(c))  //\'c8\'e7\'b9\'fb\'ca\'c7\'d4\'cb\'cb\'e3\'b7\'fb  \par
        \{  \par
            if(flag)\{  \par
                seqStackPush(StackData,q);  //\'b1\'ed\'b4\'ef\'ca\'bd\'c8\'eb\'d5\'bb  \par
                q=0;   //\'b2\'d9\'d7\'f7\'ca\'fd\'c7\'e5\'c1\'e3   \par
                flag=0;   //\'b1\'ea\'d6\'be\'c7\'e5\'c1\'e3\'a3\'ac\'b1\'ed\'ca\'be\'b2\'d9\'d7\'f7\'ca\'fd\'d2\'d1\'be\'ad\'c8\'eb\'d5\'bb   \par
            \}  \par
            switch(PRI(x,c))   //\'c5\'d0\'b6\'cf\'d4\'cb\'cb\'e3\'b7\'fb\'d3\'c5\'cf\'c8\'bc\'b6  \par
            \{  \par
                case -1:  \par
                    seqStackPush(StackOper,c);  //\'d4\'cb\'cb\'e3\'b7\'fb\'bd\'f8\'d5\'bb  \par
                    c=exp[i++];  \par
                    break;  \par
                case 0:  \par
                    c=seqStackPop(StackOper);  //\'d4\'cb\'cb\'e3\'b7\'fb\'c0\'a8\'ba\'c5\'a3\'ac\'b5\'c8\'ba\'c5\'b3\'f6\'d5\'bb\'a3\'ac\'b1\'bb\'c5\'d7\'c6\'fa  \par
                    c=exp[i++];   //\'c8\'a1\'cf\'c2\'d2\'bb\'b8\'f6 \'d7\'d6\'b7\'fb   \par
                    break;   \par
                case 1:  \par
                    oper=seqStackPop(StackOper);   //\'d4\'cb\'cb\'e3\'b7\'fb\'b3\'f6\'d5\'bb  \par
                    b=seqStackPop(StackData);  \par
                    a=seqStackPop(StackData);  //\'c1\'bd\'b8\'f6\'b2\'d9\'d7\'f7\'ca\'fd\'b3\'f6\'d5\'bb  \par
                    t=Calc(a,oper,b);  //\'bc\'c6\'cb\'e3\'bd\'e1\'b9\'fb  \par
                    seqStackPush(StackData,t);  //\'bd\'ab\'d4\'cb\'cb\'e3\'bd\'e1\'b9\'fb\'c8\'eb\'d5\'bb   \par
                 break;  \par
                    \par
            \}   \par
        \}else if(c>='0'&&c<='9')  //\'c8\'e7\'b9\'fb\'ca\'e4\'b3\'f6\'b5\'c4\'d7\'d6\'b7\'fb\'d4\'da0\'b5\'bd9\'d6\'ae\'bc\'e4  \par
        \{  \par
            c-='0';   //\'b0\'d1\'d7\'d6\'b7\'fb\'d7\'aa\'bb\'bb\'b3\'c9\'ca\'fd\'d7\'d6  \par
            q=q*10+c;       //\'b6\'e0\'ce\'bb\'ca\'fd\'b5\'c4\'bd\'f8\'ce\'bb\'b4\'a6\'c0\'ed  \par
              \par
            c=exp[i++];  //\'c8\'a1\'b3\'f6\'cf\'c2\'d2\'bb\'ce\'bb\'d7\'d6\'b7\'fb  \par
             flag=1;  //\'c9\'e8\'d6\'c3\'b1\'ea\'d6\'be\'a3\'ac\'b1\'ed\'ca\'be\'b2\'d9\'d7\'f7\'ca\'fd\'ce\'b4\'c8\'eb\'d5\'bb  \par
        \}   \par
        else \{  \par
            printf("\'ca\'e4\'c8\'eb\'b4\'ed\'ce\'f3\\n");  \par
            getch();  \par
            exit(0);  \par
        \}  \par
        x=seqStackPeek(StackOper);  //\'bb\'f1\'c8\'a1\'d5\'bb\'b6\'a5\'b2\'d9\'d7\'f7\'b7\'fb   \par
    \}   \par
    q=seqStackPop(StackData);     \par
    seqStackfree(StackOper);    \par
    seqStackfree(StackData);  //\'ca\'cd\'b7\'c5\'c4\'da\'b4\'e6\'d5\'bc\'d3\'c3\'bf\'d5\'bc\'e4  \par
    return q;  //\'b3\'f6\'d5\'bb\'a3\'ac\'b7\'b5\'bb\'d8\'bd\'e1\'b9\'fb   \par
            \par
\}   \par
\par
//\'d6\'f7\'d2\'aa\'bc\'c6\'cb\'e3\'ba\'af\'ca\'fd\par
void Find(int n)  \par
\{  \par
    if (n == 1)  \par
    \{  \par
        if ( fabs(number[0] - VOLUE) <= LING )  \par
        \{  \par
            cout << expression[0] << "\\t\\t";  \par
            m_judge = true;  \par
            count ++;  \par
            if((count % 3)==0) //\'ca\'b9\'ca\'e4\'b3\'f6\'ca\'b1\'c3\'bf\'d0\'d0\'c8\'fd\'b8\'f6\'b1\'ed\'b4\'ef\'ca\'bd  \par
                cout<<endl;  \par
        \}  \par
        else  \par
        \{ \}  \par
    \}  \par
    for(int i=0; i < n; i++)//\'b2\'e9\'d5\'d2  \par
    \{  \par
        for (int j = i + 1; j < n; j++)//\'d3\'eb\'c6\'e4\'ba\'f3\'c3\'e6\'b5\'c4\'b2\'e9\'d5\'d2\'bd\'f8\'d0\'d0\'bc\'c6\'cb\'e3  \par
        \{  \par
            double a, b;  \par
            string expressiona, expressionb;  \par
            a = number[i];  \par
            b = number[j];  \par
            number[j] = number[n - 1];  \par
            expressiona = expression[i];  \par
            expressionb = expression[j];  \par
            expression[j] = expression[n - 1];  \par
            expression[i]= '('+ expressiona + '+' + expressionb + ')';  \par
            number[i] = a + b;  \par
            Find(n-1);  \par
            expression[i]='('+ expressiona+ '-' + expressionb + ')';  \par
            number[i] = a - b;  \par
            Find(n-1);  \par
            expression[i] = '('+expressionb + '-' + expressiona + ')';  \par
            number[i] = b -a;  \par
            Find(n-1);  \par
            expression[i]= '('+ expressiona +'*'+ expressionb+ ')';  \par
            number[i]=a*b;  \par
            Find(n-1);  \par
            if (b != 0)  \par
            \{  \par
                expression[i] ='('+expressiona+'/' + expressionb + ')';  \par
                number[i] = a / b;  \par
                Find(n-1);  \par
            \}  \par
            if (a != 0)  \par
            \{  \par
                expression[i]='('+expressionb + '/'+ expressiona + ')';  \par
                number[i] = b / a;  \par
                Find(n-1);  \par
            \}  \par
            number[i] =a;  \par
            number[j]=b;  \par
            expression[i] = expressiona;  \par
            expression[j] = expressionb;  \par
        \}  \par
    \}  \par
\}\par
//\'ca\'be\'b7\'b6\'cb\'e3\'ca\'bd\par
void Demonstration()\par
\{\par
\tab int  x;\par
\tab srand((unsigned)time(NULL));\par
    cout<<"\'cb\'c4\'b8\'f6\'cb\'e6\'bb\'fa\'ca\'fd:\\n";  \par
    for (int i = 0; i < CONT; i++)  \par
    \{  \par
        char ch[20];    \par
        number[i]=x=1+rand()%13 ;\par
\tab\tab cout<<"\'b5\'da"<<i+1<<"\'b8\'f6\'ca\'fd\'ce\'aa:"<<x<<endl;\par
        itoa(number[i],ch, 10); //itoa()\'ba\'af\'ca\'fd\'b5\'c4\'d7\'f7\'d3\'c3\'ca\'c7\'b0\'d1\'b5\'da\'d2\'bb\'b8\'f6\'b2\'ce\'ca\'fd(\'ca\'fd\'d6\'b5)\'b4\'ab\'cb\'cd(\'d7\'aa\'bb\'bb)\'b5\'bd\'b5\'da\'b6\'fe\'b8\'f6\'b2\'ce\'ca\'fd(\'d7\'d6\'b7\'fb\'b4\'ae)\'d6\'d0\'c8\'a5\'a3\'ac\'b5\'da\'c8\'fd\'b8\'f6\'b2\'ce\'ca\'fd(int\'d0\'cd)\'ca\'c7\'b8\'c3\'ca\'fd\'d6\'b5\'d4\'da\'d7\'d6\'b7\'fb\'b4\'ae\'c0\'ef\'d2\'d4\'ca\'b2\'c3\'b4\'bd\'f8\'d6\'c6\'b4\'e6\'b7\'c5\'a1\'a3  \par
        expression[i] = ch;  \par
    \}  \par
    cout<<endl;  \par
    Find(CONT) ;  \par
    if(m_judge==true)  \par
    \{  \par
        cout << "\\n\'b3\'c9\'b9\'a6\'a3\'a1" << endl;  \par
        cout<<"\'d7\'dc\'b9\'b2\'b5\'c4\'bc\'c6\'cb\'e3\'b7\'bd\'b7\'a8\'b9\'b2\'d3\'d0\'a3\'ba "<<count<<endl;  \par
    \}  \par
    else  \par
    \{  \par
        cout << "\'b8\'c3\'ca\'fd\'d7\'d6\'ce\'de\'b7\'a8\'ca\'b5\'cf\'d624\'b5\'e3!" << endl;  \par
    \}  \par
\}\par
//\'b2\'e2\'ca\'d4\'ba\'af\'ca\'fd\par
void Testing()\par
\{\par
\tab int  x,y;\par
\tab char EXP[100];\par
\tab srand((unsigned)time(NULL));\par
    cout<<"\'cb\'c4\'b8\'f6\'cb\'e6\'bb\'fa\'ca\'fd:\\n";  \par
    for (int i = 0; i < CONT; i++)  \par
    \{  \par
        char ch[20];    \par
        number[i]=x=1+rand()%12 ;\par
\tab\tab cout<<"\'b5\'da"<<i+1<<"\'b8\'f6\'ca\'fd\'ce\'aa:"<<x<<endl;\par
        itoa(number[i],ch, 10); //itoa()\'ba\'af\'ca\'fd\'b5\'c4\'d7\'f7\'d3\'c3\'ca\'c7\'b0\'d1\'b5\'da\'d2\'bb\'b8\'f6\'b2\'ce\'ca\'fd(\'ca\'fd\'d6\'b5)\'b4\'ab\'cb\'cd(\'d7\'aa\'bb\'bb)\'b5\'bd\'b5\'da\'b6\'fe\'b8\'f6\'b2\'ce\'ca\'fd(\'d7\'d6\'b7\'fb\'b4\'ae)\'d6\'d0\'c8\'a5\'a3\'ac\'b5\'da\'c8\'fd\'b8\'f6\'b2\'ce\'ca\'fd(int\'d0\'cd)\'ca\'c7\'b8\'c3\'ca\'fd\'d6\'b5\'d4\'da\'d7\'d6\'b7\'fb\'b4\'ae\'c0\'ef\'d2\'d4\'ca\'b2\'c3\'b4\'bd\'f8\'d6\'c6\'b4\'e6\'b7\'c5\'a1\'a3  \par
        expression[i] = ch;  \par
    \}  \par
    cout<<endl;\par
\tab cout<<"\'c7\'eb\'ca\'e4\'c8\'eb\'c4\'e3\'b5\'c4\'cb\'e3\'ca\'bd:";\par
\tab gets(EXP);\par
\tab y=CalcExp( EXP);\par
\tab if(y-VOLUE)\par
\tab\{\par
\tab\tab cout<<"\'c4\'e3\'b5\'c4\'cb\'e3\'ca\'bd\'d3\'d0\'ce\'ca\'cc\'e2"<<endl;\par
\tab\tab cout<<"\'d5\'fd\'c8\'b7\'b4\'f0\'b0\'b8\'ce\'aa:";\par
\tab\tab Find(CONT) ; \par
\tab\}\par
\tab else\par
\tab\{\par
\tab\tab cout<<"\'b9\'a7\'cf\'b2\'c4\'e3\'bb\'d8\'b4\'f0\'d5\'fd\'c8\'b7!"<<endl;\par
\tab\}\par
\par
\}\par
//\'b2\'d9\'d7\'f7\'bd\'e7\'c3\'e6 \par
void Switch()\par
\{\par
\tab int choose;//\'b9\'a6\'c4\'dc\'d1\'a1\'d4\'f1\par
\tab cout<<"--------------------"<<endl;\par
\tab cout<<"  \'bb\'b6\'d3\'ad\'ca\'b9\'d3\'c324\'b5\'e3\'d3\'ce\'cf\'b7"<<endl;\par
\tab cout<<"    1.\'ca\'be\'b7\'b6\'cb\'e3\'ca\'bd"<<endl;\par
\tab cout<<"    2.\'d7\'d4\'bc\'ba\'b2\'e2\'ca\'d4"<<endl;\par
\tab cout<<"    3.\'cd\'cb\'b3\'f624\'b5\'e3\'d3\'ce\'cf\'b7"<<endl;\par
\tab cout<<"--------------------"<<endl;\par
\tab while(1)\{\par
\tab\tab cout<<"\'c7\'eb\'ca\'e4\'c8\'eb\'b2\'d9\'d7\'f7\'b7\'ac\'ba\'c5:";\par
\tab\tab cin>>choose;\par
\tab\tab cout<<endl;\par
\tab\tab switch(choose)\par
\tab\tab\{\par
\tab\tab case 1:\par
\tab\tab\tab Demonstration();break;\par
\tab\tab case 2:\par
\tab\tab\tab Testing();break;\par
\tab\tab case 3:\par
\tab\tab\tab return;\par
\tab\tab default: cout<<"\'c7\'eb\'d4\'da1-3\'d6\'ae\'bc\'e4\'d1\'a1\'d4\'f1"<<endl;\par
\par
\tab\tab\}\par
\tab\}\par
\tab\tab\par
\} \par
int main()  \par
\{   \par
\tab Switch();\par
    return 0;  \par
\}  \par
}
 